
\documentclass[conference]{IEEEtran}
\usepackage{amsthm}
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage[dvips]{graphicx}
\usepackage{enumerate}


\input{def}

\usepackage[margin=1in]{geometry}



\begin{document}

\title{Paper Draft 2 for Channelization Problem}
\author{Navid Hamed Azimi}
\maketitle

\begin{abstract}
To be Modified Later

Assume we are give a number of wireless links and a free spectrum. We want to divide the spectrum such that the maximum capacity as computed by Shannon Law is maximized. In this paper, we first solve the problem in special case in which we only have two links. We prove that in the case of just two links, the links should each either use the entire spectrum or use non-overlapping parts of the spectrum. We then use the solution for the two links as a local search method to develop a global search heuristic for the solution of the general problem.
\end{abstract}



\section{Introduction}
%\input{Introduction}
%\vspace{3cm}

\section{Problem Definition, Models and Notations}
\label{sec:model}
\input{Model}

\section{Spectrum Division for Two Wireless Links}
\input{TwoChannel}

\subsection{Two Wireless Links with Colored Noise}
\label{sec:TwoLinksColoredNoise}
\input{ColoredTwoChannel}

\section{Channelization for Multiple Links}
\input{MultipleLinks}


\section{Channelization for Multiple Links For short link length}




\section{proofs}
\label{sec:proofs}
\input{proofs}

%\input{HardToApproximate}
%\vspace{20cm}
\end{document}









